منابع مشابه
Rooted Uniform Monotone Minimum Spanning Trees
We study the construction of the minimum cost spanning geometric graph of a given rooted point set P where each point of P is connected to the root by a path that satisfies a given property. We focus on two properties, namely the monotonicity w.r.t. a single direction (y-monotonicity) and the monotonicity w.r.t. a single pair of orthogonal directions (xy-monotonicity). We propose algorithms tha...
متن کاملCounting rooted spanning forests in complete multipartite graphs
Jin and Liu discovered an elegant formula for the number of rooted spanning forests in the complete bipartite graph a1;a2 , with b1 roots in the rst vertex class and b2 roots in the second vertex class. We give a simple proof to their formula, and a generalization for complete m-partite graphs, using the multivariate Lagrange inverse. Y. Jin and C. Liu [3] give a formula for f(m; l;n; k), the n...
متن کاملSLIC Superpixels
Superpixels are becoming increasingly popular for use in computer vision applications. However, there are few algorithms that output a desired number of regular, compact superpixels with a low computational overhead. We introduce a novel algorithm that clusters pixels in the combined five-dimensional color and image plane space to efficiently generate compact, nearly uniform superpixels. The si...
متن کاملImproving Depth Estimation Using Superpixels
This work is focused on assigning a depth label to each pixel in the image. We consider off-the-shelf algorithms that provide depth information from multiple views or depth information directly obtained from RGB-d sensors. Both of them are common scenarios of a well studied problem where many times we get incomplete depth information. Then, user interaction becomes necessary to finish, improve ...
متن کاملA Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem
The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting networks where quality of service constraints are of concern. We present a construction heuristic based on Kruskal’s algorithm for finding a minimum cost spanning tree which eliminates some drawbacks of existing heuristic metho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Vision
سال: 2020
ISSN: 0920-5691,1573-1405
DOI: 10.1007/s11263-020-01352-9